Implementation with Partial Verification
نویسنده
چکیده
This paper examines the implementability of social choice functions when only partial verification of private information is possible. Green and Laffont (1986) used this framework to derive a necessary and sufficient condition for the revelation principle to continue to hold with partial verification. We provide economically interesting characterizations of this condition, which suggest that it may be too restrictive. This leads us to consider implementation (not necessarily truthful) in general, when there is partial verification. We consider the case where compensatory transfers are allowed, giving the mechanism designer further leeway. We show how partial verification may allow efficient implementation of bilateral trade, where it would otherwise not be possible.
منابع مشابه
Verification of a Quality Management Theory: Using a Delphi Study
Background A model of quality management called Strategic Collaborative Quality Management (SCQM) model was developed based on the quality management literature review, the findings of a survey on quality management assessment in healthcare organisations, semi-structured interviews with healthcare stakeholders, and a Delphi study on healthcare quality management experts. The purpose of this stu...
متن کاملSpace Effective Model Checking for Component-Interaction Automata
The techniques of component-based development are becoming a common practice in the area of software engineering. One of the crucial issues in the correctness of such systems is the correct interaction among the components. The formalism of component-interaction automata was devised to model various aspects of such interaction, as well as to allow automated verification in the form of model che...
متن کاملSecurity Benchmarking using Partial Verification
Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to place a numerical upper bound on the insecurity of systems, in order to motivate improvement.
متن کاملVerification of the C0 compiler implementation on the source code level
This thesis concerns practical application of two methods for program verification. The programming language we consider is a C dialect, called C0, which supports dynamic memory allocation, recursion, pointer types, etc. First, we verify a program using a formalization of small-step semantics of C0. The example we study is a small loop program, which allocates a linked list of the given length ...
متن کاملA Practical Approach to Interval Refinement for math.h/cmath Functions
Verification of C/C++ programs has seen considerable progress in several areas, but not for programs that use these languages’ mathematical libraries. The reason is that all libraries in widespread use come without no guarantees about the computed results. This would seem to prevent any attempt at formal verification of programs that use them: without a specification for the functions, no concl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000